Monitoring Realizability
نویسندگان
چکیده
We present a new multi-valued monitoring approach for linear-time temporal logic that classifies trace prefixes not only according to the existence of correct and erroneous continuations, but also according to the strategic power of the system and its environment to avoid or enforce a violation of the specification. We classify the monitoring status into four levels: (1) the worst case is a violation, where no continuation satisfies the specification any more; (2) unrealizable means that the environment can force the system to violate the specification; (3) realizable means that the system can enforce that the specification is satisfied; (4) the best case, fulfilled, indicates that all possible continuations satisfy the specification. Because our approach recognizes situations where the system cannot avoid a violation even though there may still be continuations in which the specification is satisfied, our approach detects errors earlier, and it detects errors that are missed by less detailed classifications. We give an asymptotically optimal construction of multi-valued monitoring automata based on parity games.
منابع مشابه
Study about Realizability Situation and Utilization Contexts of Water Sensitive Urban Design
Climate changes, failure to complete the natural cycle of water in the city due to unsustainableconstruction of the urban environments and increase of impervious surfaces, lack of nutrition of undergroundaquifer in the cities, unsustainable management of stormwater and the floods due to them in the periods of rainfallcaused to provide an approach that is called water sensitive urban design. Thi...
متن کاملRealizing arithmetical formulæ
Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical realizability Realizability game Zoology Gender equality Introduction Curry-Howard Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical ...
متن کاملPrimitive Recursive Realizability and Basic Propositional Logic
Two notions of primitive recursive realizability for arithmetic sentences are considered. The first one is strictly primitive recursive realizability introduced by Z. Damnjanovic in 1994. We prove that intuitionistic predicate logic is not sound with this kind of realizability. Namely there exists an arithmetic sentence which is deducible in the intuitionistic predicate calculus but is not stri...
متن کاملClassical Realizability in the CPS Target Language
Motivated by considerations about Krivine’s classical realizability, we introduce a term calculus for an intuitionistic logic with record types, which we call the CPS target language. We give a reformulation of the constructions of classical realizability in this language, using the categorical techniques of realizability triposes and toposes. We argue that the presentation of classical realiza...
متن کاملA General Notion of Realizability
We present a general notion of realizability encompassing both standard Kleene style realizability over partial combinatory algebras and Kleene style realizability over more general structures, including all partial cartesian closed categories. We show how the general notion of realizability can be used to get models of dependent predicate logic, thus obtaining as a corollary (the known result)...
متن کاملAnalytic Constraints and Realizability for Analytic Input/Output Operators∗
For input/ouput (i/o) operators, an equivalence is shown between realizability by state space systems and the existence of analytic constraints on higher order derivatives of i/o signals. This provides a precise characterization of realizability, extending to the general analytic case previous work that dealt with the equivalence between algebraic realizability and algebraic i/o equations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011